3

Layer-free upward crossing minimization

Year:
2010
Language:
english
File:
PDF, 1.11 MB
english, 2010
4

Facets in the Crossing Number Polytope

Year:
2011
Language:
english
File:
PDF, 956 KB
english, 2011
5

Strong Steiner Tree Approximations in Practice

Year:
2019
Language:
english
File:
PDF, 1.06 MB
english, 2019
12

Non-planar core reduction of graphs

Year:
2009
Language:
english
File:
PDF, 1.49 MB
english, 2009
13

A tighter insertion-based approximation of the crossing number

Year:
2017
Language:
english
File:
PDF, 1.03 MB
english, 2017
14

Exact Approaches to Multilevel Vertical Orderings

Year:
2013
Language:
english
File:
PDF, 334 KB
english, 2013
16

Crossing number additivity over edge cuts

Year:
2013
Language:
english
File:
PDF, 384 KB
english, 2013
17

Vertex insertion approximates the crossing number of apex graphs

Year:
2012
Language:
english
File:
PDF, 273 KB
english, 2012
18

Improved Steiner tree algorithms for bounded treewidth

Year:
2012
Language:
english
File:
PDF, 425 KB
english, 2012
19

Obtaining optimal k -cardinality trees fast

Year:
2009
Language:
english
File:
PDF, 3.75 MB
english, 2009
20

Toroidal grid minors and stretch in embedded graphs

Year:
2019
Language:
english
File:
PDF, 2.19 MB
english, 2019
21

Approximating Spanning Trees with Few Branches

Year:
2015
Language:
english
File:
PDF, 572 KB
english, 2015
22

Upward Planarity Testing in Practice

Year:
2015
Language:
english
File:
PDF, 2.95 MB
english, 2015
27

How not to characterize planar-emulable graphs

Year:
2013
Language:
english
File:
PDF, 951 KB
english, 2013
30

On the Minimum Cut of Planarizations

Year:
2007
Language:
english
File:
PDF, 294 KB
english, 2007
32

Computing the Stretch of an Embedded Graph

Year:
2014
Language:
english
File:
PDF, 220 KB
english, 2014